Step-indexed kripke models over recursive worlds
نویسندگان
چکیده
منابع مشابه
Kripke Models over Recursively Defined Metric Worlds: Steps and Domains
We show that models of higher-order store phenomenanaturally can be given as Kripke models over worlds thatare recursively defined in a category of metric spaces. Itleads to a unification of methods based on classical do-main theory and on step-indexed operational models. Weshow that our metric approach covers a wide range of step-indexed models, by demonstrating how it ...
متن کاملA Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces
Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow one to hide irrelevant parts of the state during verification, whereas the anti-frame rule allows one to hide local state from the context. We give the first sound model for Charguéraud and Pottier’s type and capability system including both frame and anti-frame rules. The model ...
متن کاملStep-Indexed Kripke Model of Separation Logic for Storable Locks
We present a version of separation logic for modular reasoning about concurrent programs with dynamically allocated storable locks and dynamic thread creation. The assertions of the program logic are modelled by a Kripke model over a recursively defined set of worlds and the program logic is proved sound through a Kripke relation to the standard operational semantics. This constitutes an elegan...
متن کاملA step-indexed Kripke model of hidden state
Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow one to hide irrelevant parts of the state during verification, whereas the anti-frame rule allows one to hide local state from the context. We discuss the semantic foundations of frame and anti-frame rules, and present the first sound model for Charguéraud and Pottier’s type and ...
متن کاملStep-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative universal and existential types. We show that for recursive and polymorphic types, the method is both sound and complete with respect to contextual equivalence, while for existential types, it is sound but incomplete. Our de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2011
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1925844.1926401